The Number of Polytopes, Configurations and Real Matroids
نویسنده
چکیده
We show that the number of combinatorially distinct labelled d-polytopes on n vertices is at most (n/oo. A similar bound for the number of simplicial polytopes has previously been proved by Goodman and Pollack. This bound improves considerably the previous known bounds. We also obtain sharp upper and lower bounds for the numbers of real oriented and unoriented matroids with n elements of rank d. Our main tool is a theorem of Milnor and Thorn from real algebraic geometry. §
منابع مشابه
Boundary Complexes of Convex Polytopes Cannot Be Characterized Locally
It is well known that there is no local criterion to decide the linear readability of matroids or oriented matroids. We use the set-up of chirotopes or oriented matroids to derive a similar result in the context of convex polytopes. There is no local criterion to decide whether a combinatorial sphere is polytopal. The proof is based on a construction technique for rigid chirotopes. These corres...
متن کاملMany 2-Level Polytopes from Matroids
The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already successfully analyzed from the enumerative perspective. We bring to light some structural properties of 2-level matroids and exploit them for enumerative pur...
متن کاملThe Universality Theorems for Oriented Matroids and Polytopes
Universality Theorems are exciting achievements in the theories of polytopes and oriented matroids. This article surveys the main developments in that context. We explain the basic constructions that lead to Universality Theorems. In particular, we show that one can use the Universality Theorem for rank 3 oriented matroids to obtain a Universality Theorem for 6-dimensional polytopes. 1 Universa...
متن کاملOriented Matroids
The theory of oriented matroids provides a broad setting in which to model, describe, and analyze combinatorial properties of geometric configurations. Apparently totally different mathematical objects such as point and vector configurations, arrangements of hyperplanes, convex polytopes, directed graphs, and linear programs find a common generalization in the language of oriented matroids. The...
متن کاملOn the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes
This paper develops new combinatorial and geometric techniques for studying the topology of the real semialgebraic variety 31 (M) of all realizations of an oriented matroid M . We focus our attention on point configurations in general position, and as the main result we prove that the realization space of every uniform rank 3 oriented matroid with up to eight points is contractible. For these s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986